Top-k Queries in Uncertain OLAP Master Scholarly Paper
نویسنده
چکیده
Top-k is the most important query type in OLAP, a common data warehouses model. Recently, OLAP was extended to represent data ambiguity, specifically imprecision and uncertainty. However, how to deal with top-k queries in uncertain OLAP still remains an unanswered question. This project introduces a solution for top-k query evaluation in uncertain OLAP including query semantic definition, query processing algorithm and data materialization. An experimental evaluation showed that the proposed solution is feasible.
منابع مشابه
Top-k Queries in Uncertain OLAP
Top-k is the most important query type in OLAP, the most common data warehouses model. Recently, OLAP was extended to represent data ambiguity, specifically imprecision and uncertainty. However, how to deal with top-k queries in uncertain OLAP still remain an unanswered question. This project introduces a complete solution for top-k query in uncertain OLAP including query semantic definition, q...
متن کاملAn efficient, robust method for processing of partial top-k/bottom-k queries using the RD-Tree in OLAP
Online analytical processing (OLAP) is a widely used technology for facilitating decision support applications. In the paper, we consider partial aggregation queries, especially for partial top-k/bottom-k, which retrieve the top/bottom-k records among the specified cells of the given query. For the efficient processing of partial ranking queries, this paper proposes a set of algorithms using th...
متن کاملRange Top/Bottom k Queries in OLAP Sparse Data Cubes
A range top k query finds the top k maximum values over all selected cells of an OLAP data cube where the selection is specified by the range of contiguous values for each dimension. In this paper, we propose a partitionbased storage structure, which is capable of answering both range top and bottom k queries in OLAP sparse data cubes. This is achieved by partitioning a multi-dimensional sparse...
متن کاملEfficient Processing of Ad-Hoc Top-k Aggregate Queries in OLAP
In this paper, we develop a principled framework for efficient processing of ad-hoc top-k (ranking) aggregate queries in OLAP. Such queries provide the k groups with the highest aggregates to decision makers. Essential support of top-k aggregate queries is lacking in current RDBMSs, which process such queries in a naı̈ve and overkill materialize-group-sort scheme, therefore can be prohibitively ...
متن کاملTop-k best probability queries and semantics ranking properties on probabilistic databases
There has been much interest in answering top-k queries on probabilistic data in various applications such as market analysis, personalised services, and decision making. In probabilistic relational databases, the most common problem in answering top-k queries (ranking queries) is selecting the top-k result based on scores and top-k probabilities. In this paper, we firstly propose novel answers...
متن کامل